MapLite 2.0: Online HD Map Inference Using a Prior SD Map

نویسندگان

چکیده

Deploying fully autonomous vehicles has been a subject of intense research in both industry and academia. However, the majority these efforts have relied heavily on High Definition (HD) prior maps. These are necessary to provide planning control modules rich model operating environment. While this approach shown success, it drastically limits scale scope deployments as creating maintaining HD maps for very large areas can be prohibitive. In work, we present new method building map online by starting with Standard (SD) such navigational road map, incorporating onboard sensors infer local map. We evaluate our extensively 100 sequences real-world vehicle data demonstrate that highly structured map-like world accurately using only SD sensors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kharita: Robust Map Inference using Graph Spanners

Œewidespread availability of GPS information in everyday devices such as cars, smartphones and smart watches make it possible to collect large amount of geospatial trajectory information. A particularly important, yet technically challenging, application of this data is to identify the underlying road network and keep it updated under various changes. In this paper, we propose ecient algorithm...

متن کامل

MAP Inference in Chains using Column Generation

Linear chains and trees are basic building blocks in many applications of graphical models, and they admit simple exact maximum a-posteriori (MAP) inference algorithms based on message passing. However, in many cases this computation is prohibitively expensive, due to quadratic dependence on variables’ domain sizes. The standard algorithms are inefficient because they compute scores for hypothe...

متن کامل

Distributed Anytime MAP Inference

We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that allows application of the Dantzig-Wolfe decomposition principle. Subprograms are defined over individual edges and can be computed in a distributed manner. This a...

متن کامل

Anytime Marginal MAP Inference

This paper presents a new anytime algorithm for the marginal MAP problem in graphical models of bounded treewidth. We show asymptotic convergence and theoretical error bounds for any fixed step. Experiments show that it compares well to a state-of-the-art systematic search algorithm.

متن کامل

A Novel Approach to Background Subtraction Using Visual Saliency Map

Generally human vision system searches for salient regions and movements in video scenes to lessen the search space and effort. Using visual saliency map for modelling gives important information for understanding in many applications. In this paper we present a simple method with low computation load using visual saliency map for background subtraction in video stream. The proposed technique i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2022

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2022.3186491